A Hierarchy of Semantics for Normal

The diierent properties characterizing the operational behavior of logic programs can be organized in a hierarchy of xpoint semantics related by Galois insertions, having the least Herbrand model as most abstract semantics, and the SLD operational semantics as most concrete semantics. The choice of a semantics in the hierarchy allows to model precisely the program properties of interest while getting rid of useless details of too concrete semantics, which is crucial for the development of eecient program analysis tools. The aim of this paper is to push forward these methods by making them apply to normal (constraint) logic programs, that is full rst-order (non Horn) programs. The xpoint semantics deened by the rst author for the rule of constructive negation by pruning is at the center of the hierarchy developed in this paper. We show that that semantics can be obtained by concretization of Kunen's semantics deened as a xpoint, taken as the most abstract semantics of the hierarchy, and that by further concretization it leads to a new operational semantics for normal CLP programs. The diierent observable properties of the program, such as successful derivations, nite failure, set of computed answer constraints, etc. are modeled by precise semantics in the hierarchy.